Optimization under ordinal scales: When is a greedy solution optimal?
نویسنده
چکیده
Mathematical formulation of an optimization problem often depends on data which can be measured in more than one acceptable way. If the conclusion of optimality depends on the choice of measure, then we should question whether it is meaningful to ask for an optimal solution. If a meaningful optimal solution exists and the objective function depends on data measured on an ordinal scale of measurement, then the greedy algorithm will give such a solution for a wide range of objective functions.
منابع مشابه
Support Vector Ordinal Regression
In this letter, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal scales. Both approaches guarantee that the thresholds are properly ordered at the optimal solution. The size of these optimization problems is linear in the number of training samples. The sequential minimal optimizat...
متن کاملOptimal flexible capacity in newsboy problem under stochastic demand and lead-time
In this paper, we consider a newsvendor who is going to invest on dedicated or flexible capacity, our goal is to find the optimal investment policy to maximize total profit while the newsvendor faces uncertainty in lead time and demand simultaneously. As highlighted in literature, demand is stochastic, while lead time is constant. However, in reality lead time uncertainty decreases newsvendor's...
متن کاملUtilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version
We consider ordinal approximation algorithms for a broad class of utility maximization problems for multi-agent systems. In these problems, agents have utilities for connecting to each other, and the goal is to compute a maximum-utility solution subject to a set of constraints. We represent these as a class of graph optimization problems, including matching, spanning tree problems, TSP, maximum...
متن کاملOptimal Pursuit under Partial Information
In this paper we address the control of a group of agents in the pursuit of one or several evaders that are moving in a non-accurately mapped terrain. We use the framework of partial information controlled Markov processes to describe this type of games. This allows us to combine map building and pursuit into a single stochastic optimization problem, where the cost function to minimize is the t...
متن کاملAn ordinal optimization approach to optimal control problems
We introduce an ordinal optimization approach to the study of optimal control law design. As illustration of the methodology, we find the optimal feedback control law for a simple LQG problem without the benefit of theory. For the famous unsolved Witsenhausen problem (1968, SIAM J. Control, 6(1)), a solution that is 50% better than the Witsenhausen solution is found. ( 1999 Elsevier Science Ltd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 46 شماره
صفحات -
تاریخ انتشار 1997